L-fuzzy strongest postcondition predicate transformers as L-idempotent linear or affine operators between semimodules of monotonic predicates
نویسندگان
چکیده
For a completely distributive quantale L, L-fuzzy strongest postcondition predicate transformers are introduced, and it is shown that, under reasonable assumptions, they are linear or affine continuous mappings between continuous L-idempotent semimodules of L-fuzzy monotonic predicates. © 2012 Elsevier B.V. All rights reserved.
منابع مشابه
win and sin : Predicate Transformers for Concurrency LESLIE LAMPORT Digital
The weakest liberal precondition and strongest postcondition predicate transformers are generalized to the weakest invariant and strongest invariant. These new predicate transformers are useful for reasoning about concurrent programs containing operations in which the grain of atomicity is unspecified. They can also be used to replace behavioral arguments with more rigorous assertional ones.
متن کاملwin and sin : Predicate Transformers for Concurrency LESLIE LAMPORT
The weakest liberal precondition and strongest postcondition predicate transformers are generalized to the weakest invariant and strongest invariant. These new predicate transformers are useful for reasoning about concurrent programs containing operations in which the grain of atomicity is unspecified. They can also be used to replace behavioral arguments with more rigorous assertional ones.
متن کاملRelating Multifunctions and Predicate Transformers through Closure Operators
We study relations between predicate transformers and mul-tifunctions in a topological setting based on closure operators. We give topological deenitions of safety and liveness predicates and using these predicates we deene predicate transformers. State transformers are mul-tifunctions with values in the collection of xed points of a closure operator. We derive several isomorphisms between pred...
متن کاملEmbedding Modes into Semimodules, Part I
By recent results of M. Stronkowski, it is known that not all modes embed as subreducts into semimodules over commutative unital semirings. Related to this problem is the problem of constructing a (commutative unital) semiring defining the variety of semimodules whose idempotent subreducts lie in a given variety of modes. We provide a general construction of such semirings, along with basic exa...
متن کاملJAN a Weakest Preconditions for Progress
Predicate transformers that map the postcondition and all intermediate conditions of a command to a precondition are introduced They can be used to specify certain progress properties of sequential programs
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fuzzy Sets and Systems
دوره 208 شماره
صفحات -
تاریخ انتشار 2012